A modified greedy algorithm for dispersively weighted 3-set cover
نویسندگان
چکیده
منابع مشابه
An analysis of the Greedy Algorithm for Stochastic Set Cover
V ∋vpF (V ). We assume that the qF ’s are given but pF ’s are not. Repeated evaluations of a filter yields the same state: in particular, evaluations of a filter F by two distinct algorithms yields the same V (F ). We assume filters are independent: conditioning on the complete or partial state of filters other than F does not alter the state distribution of F . Let C(F ) denote the cost of eva...
متن کاملGreedy Set Cover Estimations
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper. Introduction The greedy heuristic is the most used for optimization problems. The general approach is as follows: repeatedly, a procedure that minimizes (maximizes) the local increase of the objective function is applied. In some cases the greedy strategy guarantees the...
متن کاملGreedy Set-Cover Algorithms
1 PROBLEM DEFINITION Given a collection S of sets over a universe U , a set cover C ⊆ S is a subcollection of the sets whose union is U. The set-cover problem is, given S, to find a minimum-cardinality set cover. In the weighted set-cover problem, for each set s ∈ S a weight w s ≥ 0 is also specified, and the goal is to find a set cover C of minimum total weight s∈C w s. Weighted set cover is a...
متن کاملA Tighter Analysis of Set Cover Greedy Algorithm for Test Set
Set cover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of approximation ratio of this algorithm. The author improves the approximation ratio 2 lnn directly derived from set cover to 1.14 lnn by applying potential function technique of derandomization method. In addition, the author gives a nontrivial lower bound (1+α...
متن کاملProbability-driven Greedy Algorithms for Set Cover
The Set Covering Problem (SCP) is one of the oldest, most common, and most studied NP–hard problems (Garey, Johnson, 1979) since it involves wide practical applications, e.g. showed that the performance ratio of this method is no worse than H(m), where H(m) = 1 + … + 1/m is the m-th harmonic number. This analysis of the greedy algorithm has remained essentially unchanged until Slavìk (1997) sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.06.013